Time Varying Grouping Variables in Markov Latent Class Analysis: Some Problems and Solutions
نویسندگان
چکیده
منابع مشابه
Some Solutions , Some Problems , and Some
This is a slightly expanded written version of a plenary lecture given at the 20th IEEE Conference on Decision and Control, December 198 1, San Diego, CA. This talk is intended to help spark discussion among researchers in decision, control and estimation about the status of research in the field and of promising new directions for research. One such direction, model-based signal processing, is...
متن کاملTracking Solutions of Time Varying Linear Inverse Problems
The reconstruction of a signal from only a few measurements, deconvolving, or denoising are only a few interesting signal processing applications that can be formulated as linear inverse problems. Commonly, one overcomes the ill-posedness of such problems by finding solutions which best match some prior assumptions. These are often sparsity assumptions as in the theory of Compressive Sensing. I...
متن کاملLatent Class Analysis of the cardiometabolic risk factors in children and adolescents: the CASPIAN-V study
Background: Cardio-metabolic syndrome indicates the clustering of several risk factors. The aims of this study were to identify the subgroups of the Iranian children and adolescents on the basis of the components of the cardio-metabolic syndrome and assess the role of demographic characteristics, socioeconomic status and life style related behaviors on the membership of participants in each lat...
متن کاملGrouping Time-Varying Data for Interactive Exploration
We present algorithms and data structures that support the interactive analysis of the grouping structure of one-, two-, or higher-dimensional time-varying data while varying all defining parameters. Grouping structures characterise important patterns in the temporal evaluation of sets of time-varying data. We follow Buchin et al. [9] who define groups using three parameters: group-size, group-...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Statistics and Probability
سال: 2018
ISSN: 1927-7040,1927-7032
DOI: 10.5539/ijsp.v7n5p28